On probability generating functions for matching and occupancy distributions

Probability Generating Functions for Sattolo’s Algorithm

In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...

Some New Weighted Information Generating Functions of Discrete Probability Distributions

The aim of this paper is to introduce some new information generating functions with utilities whose derivatives give some well known measures of information. Some properties and particular cases of the proposed functions have also been studied. Mathematics Subject Classification 2000: 94A15, 94A17 Additional

Choice probability generating functions

This paper establishes that every random utility discrete choice model (RUM) has a representation that can be characterized by a choice-probability generating function (CPGF) with speci c properties, and that every function with these speci c properties is consistent with a RUM. The choice probabilities from the RUM are obtained from the gradient of the CPGF. Mixtures of RUM are characterized b...

Probability Generating Functions

Notes on Generating Probability Distributions for a given Entropy value

1 Motivation The goal is to develop an algorithm for creating a probability distribution that results in a given entropy value. Ideally, the algorithm should be able to generate all possible probability distributions, with the same probability. Nevertheless, since it is not trivial to guarantee this property, we will insert some randomness to our algorithm to ensure some variation in the results.